/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 4e6 + 10;
int notprime[maxn], cnt;
ll prime[maxn];
ll n, b;
ll ans = -1;

void init()
{
    cnt = 0;
    for (int i = 2; i < maxn; i++)
    {
        if (!notprime[i])
            prime[cnt++] = i;
        for (int j = 0; j < cnt && i * prime[j] < maxn; j++)
        {
            notprime[i * prime[j]] = 1;
            if (i % prime[j] == 0)
                break;
        }
    }
}
ll ha[maxn];
void get(ll x, ll now)
{
    ll ret = 0;
    ll t = n;
    while (t)
    {
        ret += t / x;
        t /= x;
        //cout << t << endl;
    }

    //cout << "t:" << t << ":" << now << endl;
    if (ans == -1)
        ans = ret / now;
    else
        ans = min(ans, ret / now);
}
void solve()
{
    ll t = b;
    for (ll i = 0; prime[i] * prime[i] <= b; i++)
    {

        ll now = 0;
        while (t % prime[i] == 0)
        {
            t /= prime[i];
            now++;
        }

        if (now)
            get(prime[i], now);
        //cout << i << ":" << prime[i] << "_" << t << endl;
    }
    if (t != 1ll)
    {
        get(t, 1);
    }
}
int main()
{
    IOS;
    init();
    cin >> n >> b;
    solve();
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
/***********
 * 
 * 
 * 
 * 
100000000000000 1000000000000


 **************/